The growing number of XML documents leads to the need\udfor appropriate XML querying algorithms which are able to utilize the\udspecific characteristics of XML documents. A labelling scheme is fundamental\udto processing XML queries efficiently. They are used to determine\udstructural relationships between elements corresponding to query\udnodes in twig pattern queries (TPQs). This article presents a design and\udimplementation of a new indexing technique which exploits the property\udof prime numbers to identify Parent-Child (P-C) relationships in\udTPQs during query evaluation. The Child Prime Label (CPL, for short)\udapproach can be efficiently incorporated within the existing labelling\udschemes. Here, we propose a novel twig matching algorithm based on\udthe well known TwigStack algorithm [3], which applies the CPL approach\udand focuses on reducing the overhead of storing useless elements\udand performing unnecessary join operations. Our performance evaluation\uddemonstrates that the new algorithm significantly outperforms the\udprevious approaches.\ud
展开▼
机译：XML文档的数量不断增长，因此需要能够使用XML文档特定特性的适当XML查询算法。标记方案是有效处理XML查询的基本方法。它们用于确定与树枝模式查询（TPQ）中的查询\ udnode对应的元素之间的\结构关系。本文介绍了一种新的索引技术的设计和实现，该技术利用属性\ udof素数在查询评估期间识别\ udTPQ中的父子（P-C）关系。可以将Child Prime Label（简称CPL）\ udapproach有效地合并到现有的标签\ udschemes中。在这里，我们提出了一种基于众所周知的TwigStack算法[3]的新颖的树枝匹配算法，该算法应用了CPL方法，并且着重于减少存储无用元素的开销和执行不必要的联接操作。我们的性能评估表明，新算法的性能明显优于先前的方法。
展开▼
